Trust Region versus Line Search for Computing the Optical Flow
نویسندگان
چکیده
منابع مشابه
Trust Region versus Line Search for Computing the Optical Flow
We consider the numerical treatment of the optical flow problem by evaluating the performance of the trust region method versus the line search method. To the best of our knowledge, the trust region method is studied here for the first time for variational optical flow computation. Four different optical flow models are used to test the performance of the proposed algorithm combining linear and...
متن کاملAccelerated Line-search and Trust-region Methods
A line-search method, based on retractions, is formulated on Riemannian manifolds. This Riemannian line-search method, as well as a previouslyproposed Riemannian trust-region method, are further generalized to accelerated line-search and trust-region methods, where the next iterate is allowed to be any point that produces at least as much decrease in the cost function as a fixed fraction of the...
متن کاملCombining Trust Region and Line Search Techniques
We propose an algorithm for nonlinear optimization that employs both trust region techniques and line searches Unlike traditional trust region methods our algorithm does not resolve the subproblem if the trial step results in an increase in the objective function but instead performs a backtracking line search from the failed point Backtracking can be done along a straight line or along a curve...
متن کاملA Line Search Multilevel Truncated Newton Algorithm for Computing the Optical Flow
We describe the implementation details and give the experimental results of three optimization algorithms for dense optical flow computation. In particular, using a line search strategy, we evaluate the performance of the unilevel truncated Newton method (LSTN), a multiresolution truncated Newton (MR/LSTN) and a full multigrid truncated Newton (FMG/LSTN). We use three image sequences and four m...
متن کاملFrom Line Search Method to Trust Region Method
Line search method and trust region method are two important classes of techniques for solving optimization problems and have their advantages respectively. In this paper we use the Armijo line search rule in a more accurate way and propose a new line search method for unconstrained optimization problems. Global convergence and convergence rate of the new method are analyzed under mild conditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multiscale Modeling & Simulation
سال: 2013
ISSN: 1540-3459,1540-3467
DOI: 10.1137/120897213